Computer Algorithm of Optimal Planning for Single-hand Suspension Motion

نویسنده

  • Ching-Hua Chiu
چکیده

The primary purpose of this study was to design a set of algorithm, which can compute the optimal trajectory (OT) for 3D human single-hand suspension motion. To achieve this goal, the study first established a 15-segment human body model (HBM). Then based on Lagrange-Euler equations (LEE) of motion and seven types of homogeneous transformation matrices (CH-7T) proposed by Chiu [1] , the study defined primary human segments as a dynamic system with 38 degrees of freedom (DoF). Finally, the Open-loop Linear Quadratic Controller (OLLQC) was applied to transform the dynamic system (DS) into a linear state of space. With established boundary conditions (BC) for positions and velocities, the set of algorithm, which complied with the principle of minimum energy expenditure (MEE), was adopted to compute the OT for those primary segments involved in single-hand suspension motion. To solidify the practicability of the algorithm, the subject’s segment lengths were measured, and a computer was used to simulate the motion of suspending his right hand. The simulation results showed that the algorithm in the designed DS is capable of computing the OT, velocity, and moment. The significance of this study lies in its wide application: (1) the DS designed for single-hand suspension can be used to simulate the dynamics for the gymnastics motion on flying rings and horizontal bar, rock climbing, and the movement of an astronaut in a spacecraft ; (2) this DS can be transformed into a control system (CS), which corresponds to the principle of MEE and can compute the OT for body segments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Trajectory Planning of a Box Transporter Mobile Robot

This paper aims to discuss the requirements of safe and smooth trajectory planning of transporter mobile robots to perform non-prehensile object manipulation task. In non-prehensile approach, the robot and the object must keep their grasp-less contact during manipulation task. To this end, dynamic grasp concept is employed for a box manipulation task and corresponding conditions are obtained an...

متن کامل

Near-Minimum-Time Motion Planning of Manipulators along Specified Path

The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...

متن کامل

Optimal Multi-Objective Placement of UPFC for Planning the Operation of Power Systems Using the Water Cycle Optimization Algorithm

Abstract: Unified Power Flow Controller (UPFC) is one of the FACTS devices which plays a crucial role in simultaneous regulating active and reactive power, improving system load, reducing congestion and cost of production. Therefore, determining the optimum location of such equipment in order to improve the performance of the network is significant. In this paper, WCA algorithm is used to locat...

متن کامل

Solving Dock Allocation Problem Using Improved Chemical Reaction Algorithm

Container terminals are places where cargo is transported from point to point using special equipment. One of the most important issues in planning coastal operations at container terminals is the issue of the planning of the embankment or quay, which has a significant impact on crane, yard, warehouse and truck routing programs. This research involved a basin planning model with a multi-pier si...

متن کامل

Robot Path Planning Using Cellular Automata and Genetic Algorithm

In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009